منابع مشابه
Finitely Generated Semiautomatic Groups
The present work shows that Cayley automatic groups are semiautomatic and exhibits some further constructions of semiautomatic groups and in particular shows that every finitely generated group of nilpotency class 3 is semiautomatic.
متن کاملCombinatorics of Finitely Generated Groups
of the Dissertation Combinatorics of Finitely Generated Groups
متن کاملPowers in Finitely Generated Groups
In this paper we study the set Γn of nth-powers in certain finitely generated groups Γ. We show that, if Γ is soluble or linear, and Γn contains a finite index subgroup, then Γ is nilpotent-by-finite. We also show that, if Γ is linear and Γn has finite index (i.e. Γ may be covered by finitely many translations of Γn), then Γ is soluble-by-finite. The proof applies invariant measures on amenable...
متن کاملThe Commensurability Relation for Finitely Generated Groups
There does not exist a Borel way of selecting an isomorphism class within each commensurability class of finitely generated groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1969
ISSN: 0021-8693
DOI: 10.1016/0021-8693(69)90035-0